package algorithm.tree;

public class TreeTest {

    public static void main(String[] args) {

        BST<Integer,String> t1 = new BST<>();

        t1.insertRecursion(10,"10");
        t1.insertRecursion(5,"5");
        t1.insertRecursion(11,"11");
        t1.insertRecursion(2,"2");
        t1.insertRecursion(6,"6");
        t1.insertRecursion(12,"12");
        t1.insertRecursion(13,"13");

        t1.preOrder();

        t1.inOrder();

        t1.postOrder();

        t1.levelOrder();
    }
}
